Maximal knotless graphs

نویسندگان

چکیده

A graph is maximal knotless if it edge for the property of embedding in $R^3$. We show that such a has at least $\frac74 |V|$ edges, and construct an infinite family graphs with $|E| < \frac52|V|$. With exception = 22$, we any \geq 20$ there exists size $|E|$. classify through nine vertices 20 edges. determine which these maxnik are clique sum smaller not sums.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Line graphs associated to the maximal graph

Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...

متن کامل

Cubic maximal nontraceable graphs

We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that realize this bound.

متن کامل

On radially maximal graphs

A graph is radially maximal if its radius decreases after the addition of any edge of its complement. It is proved that any graph can be an induced subgraph of a regular radially maximal graph with a prescribed radius T 2: 3. For T 2: 4, k 2: 1, radially maximal graphs with radius T containing k cut-nodes are constructed.

متن کامل

Monitoring maximal outerplanar graphs

In this paper we define a new concept of monitoring the elements of triangulation graphs by faces. Furthermore, we analyze this, and other monitoring concepts (by vertices and by edges), from a combinatorial point of view, on maximal outerplanar graphs.

متن کامل

line graphs associated to the maximal graph

let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebraic & Geometric Topology

سال: 2023

ISSN: ['1472-2739', '1472-2747']

DOI: https://doi.org/10.2140/agt.2023.23.1831